The Computation of Equilibria in Congestion Networks
نویسنده
چکیده
xiii
منابع مشابه
On the Characterization and Computation of Nash Equilibria in Horizontal Queueing Networks
Routing games (or congestion games) form an important class of non-atomic games that is used to model the interaction of agents who are sharing resources on a network, in which the cost on each edge depends on the fraction of agents using that edge. Extensive work has been dedicated to studying Nash equilibria (or user optimal assignments) of congestion games [9], [11], [14], in which all playe...
متن کاملCongestion Control Approaches Applied to Wireless Sensor Networks: A Survey
Wireless Sensor Networks (WSNs) are a specific category of wireless ad-hoc networks where their performance is highly affected by application, life time, storage capacity, processing power, topology changes, the communication medium and bandwidth. These limitations necessitate an effective data transport control in WSNs considering quality of service, energy efficiency, and congestion control. ...
متن کاملImprovement of the mechanism of congestion avoidance in mobile networks
Mobile ad hoc network congestion control is a significant problem. Standard mechanism for congestion control (TCP), the ability to run certain features of a wireless network, several mutations are not common. In particular, the enormous changes in the network topology and the joint nature of the wireless network. It also creates significant challenges in mobile ad hoc networks (MANET), density ...
متن کاملSymmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that computes a pure Nash equilibrium with respect to traffic congestion in a network. In this algorithm each user plays only once and allocates her traffic to a path selected via a shortest path computation. We then show that th...
متن کاملComputation of Output Losses due to Congestion in Data Envelopment Analysis
Data Envelopment Analysis (DEA) is an approach for evaluating performances of Decision Making Units (DMUs). The performances of DMUs are affected by the amount of sources that DMUs used. Usually increases in inputs cause increases in outputs. However, there are situations where increases in one or more inputs generate a reduction in one or more outputs. In such situations there is congesti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009